Discrete approximations of non-metrical distances

نویسندگان

  • A. Hajdu
  • T. Tóth
  • P. Veres
چکیده

In this paper we will introduce a new method for approximating non-metrical Minkowski distances. The existing approaches for Minkowski metrics considering distance functions based on local neighborhoods are not suitable for this task in their present form. In our approach we can overcome this difficulty with considering the minimum of such distance functions. In this way we can take full advantage of the former theoretical and applied results. We will use several forms for measuring the error of the approximation and propose corresponding distance functions for optimal approximation. A fast chamfering algorithm is also provided to generate the approximate distance values for applications in digital domains.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximating non-metrical Minkowski distances in 2D

In this paper we discuss a possible discrete approximation of non-metrical Minkowski distances. The existing approaches for Minkowski metrics considering distance functions based on local neighborhoods are not suitable for this task in their present form. We can overcome this difficulty with considering the minimum of such distance functions. In this way we can take full advantage of the former...

متن کامل

Metric and non-metric distances on Z by generalized neighbourhood sequences

The neighbourhood sequences have got a very important role in the digital image processing. In this paper we give some new results from this area. Using neighbourhood sequences on the n dimensional digital spaces, we give a formula to compute distances of any pairs of points. By practical reasons we underline the special cases of 2 and 3 dimensional digital spaces. It is known that there are no...

متن کامل

Continuous Discrete Variable Optimization of Structures Using Approximation Methods

Optimum design of structures is achieved while the design variables are continuous and discrete. To reduce the computational work involved in the optimization process, all the functions that are expensive to evaluate, are approximated. To approximate these functions, a semi quadratic function is employed. Only the diagonal terms of the Hessian matrix are used and these elements are estimated fr...

متن کامل

General neighborhood sequences in Zn

Neighborhoods and neighborhood sequences play important roles in several branches of pattern analysis. In earlier papers in Zn only certain special (e.g. periodic or octagonal) sequences were investigated. In this paper we study neighborhood sequences which are either ultimately periodic or allow at every neighborhood to do nothing at no cost. We give finite procedures and descriptive theoretic...

متن کامل

A novel technique for a class of singular boundary value problems

In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007